Relative t-designs in binary Hamming association scheme H(n, 2)
نویسندگان
چکیده
منابع مشابه
On Relative $t$-Designs in Polynomial Association Schemes
Motivated by the similarities between the theory of spherical t-designs and that of t-designs in Q-polynomial association schemes, we study two versions of relative t-designs, the counterparts of Euclidean t-designs for P and/or Q-polynomial association schemes. We develop the theory based on the Terwilliger algebra, which is a noncommutative associative semisimple C-algebra associated with eac...
متن کاملOn a Pair of Dual Subschemes of the Hamming Scheme Hn(q)
We consider codes in the Hamming association scheme Hn (q) with interesting metric properties. We describe how a uniformly packed linear code C determines a pair of dual subschemes. The existence of this pair of sub schemes is used to establish restrictions on the possible distances between codewords in the dual code C.L. These restrictions also apply to arbitrary codes with degree e + 1 and st...
متن کاملSymmetric chains, Gelfand–Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme
The de Bruijn–Tengbergen–Kruyswijk (BTK) construction is a simple algorithm that produces an explicit symmetric chain decomposition of a product of chains. We linearize the BTK algorithm and show that it produces an explicit symmetric Jordan basis (SJB). In the special case of a Boolean algebra, the resulting SJB is orthogonal with respect to the standard inner product and, moreover, we can wri...
متن کاملOptimal binary encoding scheme for the fast motion estimation based on Hamming distances
Optimal binary codes for pixel values are designed for accurate block matching in the fast motion estimation. The conventional binary block matching techniques reduce the computational complexity and the memory bandwidth for the motion estimation, but they degrade the matching accuracy. We find the optimal mapping function between the set of decimal numbers for uniformly quantized pixel values ...
متن کاملRelative generalized Hamming weights of cyclic codes
Abstract. Relative generalized Hamming weights (RGHWs) of a linear code respect to a linear subcode determine the security of the linear ramp secret sharing scheme based on the code. They can be used to express the information leakage of the secret when some keepers of shares are corrupted. Cyclic codes are an interesting type of linear codes and have wide applications in communication and stor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2016
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-016-0200-0